On Investigation of Crisp Bi-Objective Formulations for Fuzzy Traveling Salesman Problem and Fuzzy p-Median Problem

Abstract We consider two classic problems: the Traveling Salesman Problem and p -Median Problem. In both problems total traveling cost (in some sense) is minimized, assuming that all times are known. most real-word applications input data uncertain, this fact should be taken into account when a solution constructed. paper we investigate bi-objective versions of problems, where fuzzy uncertainty associated with (membership function) optimized. A greedy approximation algorithm proposed experimentally tested on instances from TSPLIB library.